Computing the Rooted Triplet Distance between Galled Trees by Counting Triangles
نویسندگان
چکیده
Article history: Available online 11 October 2013
منابع مشابه
Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree
The triplet and quartet distances are distance measures to compare two rooted and two unrooted trees, respectively. The leaves of the two trees should have the same set of n labels. The distances are defined by enumerating all subsets of three labels (triplets) and four labels (quartets), respectively, and counting how often the induced topologies in the two input trees are different. In this p...
متن کاملA practical O(n log n) time algorithm for computing the triplet distance on binary trees
The triplet distance is a distance measure that compares two rooted trees on the same set of leaves by enumerating all sub-sets of three leaves and counting how often the induced topologies of the tree are equal or different. We present an algorithm that computes the triplet distance between two rooted binary trees in time O ( n log n ) . The algorithm is related to an algorithm for computing t...
متن کاملOn the Scalability of Computing Triplet and Quartet Distances
In this paper we present an experimental evaluation of the algorithms by Brodal et al. [SODA 2013] for computing the triplet and quartet distance measures between two leaf labelled rooted and unrooted trees of arbitrary degree, respectively. The algorithms count the number of rooted tree topologies over sets of three leaves (triplets) and unrooted tree topologies over four leaves (quartets), re...
متن کاملComparing and Aggregating Partially Resolved Trees
We define, analyze, and give efficient algorithms for two kinds of distance measures for rooted and unrooted phylogenies. For rooted trees, our measures are based on the topologies the input trees induce on triplets; that is, on three-element subsets of the set of species. For unrooted trees, the measures are based on quartets (four-element subsets). Triplet and quartet-based distances provide ...
متن کاملCache Oblivious Algorithms for Computing the Triplet Distance Between Trees
We study the problem of computing the triplet distance between two rooted unordered trees with n labeled leafs. Introduced by Dobson 1975, the triplet distance is the number of leaf triples that induce different topologies in the two trees. The current theoretically best algorithm is an O(n logn) time algorithm by Brodal et al. (SODA 2013). Recently Jansson et al. proposed a new algorithm that,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Discrete Algorithms
دوره 25 شماره
صفحات -
تاریخ انتشار 2012